Asynchronous Execution and Communication Latency in Distributed Constraint Optimization
نویسندگان
چکیده
DCR-2002, 16 July, Bologna Outline: • Motivation: real-time coordination of sensors in a high-latency network • Modeling coordination as graph colouring • Soft graph colouring for real-time responsiveness • A class of distributed anytime algorithms (synchronous) • Convergence • Tightness of constraints: conservative variant • Scalability and robustness • Asynchronous execution • Very high communication latencies
منابع مشابه
ADOPT-ng: Unifying Asynchronous Distributed Optimization with Asynchronous Backtracking
This article presents an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs). The proposed technique unifies asynchronous backtracking (ABT) and asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning and more opportunities of communication, leading to an important speed-up. The concept of valued nogood is an extensio...
متن کاملConstraining Operation Delay for Dynamic Power Optimization of Asynchronous Circuits
In this paper, we propose a dynamic power optimization method for asynchronous circuits with bundled-data implementation constraining operation delay. In asynchronous circuits, we can change the execution time of each operation freely under a given latency constraint. Therefore, the proposed method relaxes the execution time of operations which consume more power while it tightens the execution...
متن کاملAn Asynchronous Complete Method for General Distributed Constraint Optimization
Distributed constraint optimization requires the optimization of a global objective function that is distributed as a set of valued constraints among a set of autonomous, communicating agents. To date, there does not exist an asynchronous, complete algorithm for general distributed constraint optimization problems. This paper presents Adopt, the first such algorithm that is asynchronous, operat...
متن کاملAsynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC ...
متن کاملSimulation vs Real Execution in DCOP Solving
This paper presents an experience on solving DCOP instances in a real, distributed scenario with up-to-date technology involving several machines and comparing this process with their solving in a simulator. From the result of this experience, we stress the importance of message communication time, orders of magnitude higher than the elements used in other proposed metrics to assess DCOP algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002